翻訳と辞書 |
Spherical code : ウィキペディア英語版 | Spherical code In geometry and coding theory, a spherical code with parameters (''n'',''N'',''t'') is a set of ''N'' points on the unit hypersphere in ''n'' dimensions for which the dot product of unit vectors from the origin to any two points is less than or equal to ''t''. The kissing number problem may be stated as the problem of finding the maximal ''N'' for a given ''n'' for which a spherical code with parameters (''n'',''N'',1/2) exists. The Tammes problem may be stated as the problem of finding a spherical code with minimal ''t'' for given ''n'' and ''N''. ==External links==
* *(A library of putatively optimal spherical codes )
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Spherical code」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|